Termination w.r.t. Q of the following Term Rewriting System could not be shown:

Q restricted rewrite system:
The TRS R consists of the following rules:

app2(app2(map, f), nil) -> nil
app2(app2(map, f), app2(app2(cons, x), xs)) -> app2(app2(cons, app2(f, x)), app2(app2(map, f), xs))
app2(app2(minus, x), 0) -> x
app2(app2(minus, app2(s, x)), app2(s, y)) -> app2(app2(minus, x), y)
app2(app2(div, 0), app2(s, y)) -> 0
app2(app2(div, app2(s, x)), app2(s, y)) -> app2(s, app2(app2(div, app2(app2(minus, x), y)), app2(s, y)))

Q is empty.


↳ QTRS
  ↳ Non-Overlap Check

Q restricted rewrite system:
The TRS R consists of the following rules:

app2(app2(map, f), nil) -> nil
app2(app2(map, f), app2(app2(cons, x), xs)) -> app2(app2(cons, app2(f, x)), app2(app2(map, f), xs))
app2(app2(minus, x), 0) -> x
app2(app2(minus, app2(s, x)), app2(s, y)) -> app2(app2(minus, x), y)
app2(app2(div, 0), app2(s, y)) -> 0
app2(app2(div, app2(s, x)), app2(s, y)) -> app2(s, app2(app2(div, app2(app2(minus, x), y)), app2(s, y)))

Q is empty.

The TRS is non-overlapping. Hence, we can switch to innermost.

↳ QTRS
  ↳ Non-Overlap Check
    ↳ QTRS
      ↳ DependencyPairsProof

Q restricted rewrite system:
The TRS R consists of the following rules:

app2(app2(map, f), nil) -> nil
app2(app2(map, f), app2(app2(cons, x), xs)) -> app2(app2(cons, app2(f, x)), app2(app2(map, f), xs))
app2(app2(minus, x), 0) -> x
app2(app2(minus, app2(s, x)), app2(s, y)) -> app2(app2(minus, x), y)
app2(app2(div, 0), app2(s, y)) -> 0
app2(app2(div, app2(s, x)), app2(s, y)) -> app2(s, app2(app2(div, app2(app2(minus, x), y)), app2(s, y)))

The set Q consists of the following terms:

app2(app2(map, x0), nil)
app2(app2(map, x0), app2(app2(cons, x1), x2))
app2(app2(minus, x0), 0)
app2(app2(minus, app2(s, x0)), app2(s, x1))
app2(app2(div, 0), app2(s, x0))
app2(app2(div, app2(s, x0)), app2(s, x1))


Using Dependency Pairs [1,13] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:

APP2(app2(minus, app2(s, x)), app2(s, y)) -> APP2(minus, x)
APP2(app2(map, f), app2(app2(cons, x), xs)) -> APP2(app2(cons, app2(f, x)), app2(app2(map, f), xs))
APP2(app2(map, f), app2(app2(cons, x), xs)) -> APP2(f, x)
APP2(app2(div, app2(s, x)), app2(s, y)) -> APP2(div, app2(app2(minus, x), y))
APP2(app2(minus, app2(s, x)), app2(s, y)) -> APP2(app2(minus, x), y)
APP2(app2(div, app2(s, x)), app2(s, y)) -> APP2(app2(div, app2(app2(minus, x), y)), app2(s, y))
APP2(app2(map, f), app2(app2(cons, x), xs)) -> APP2(app2(map, f), xs)
APP2(app2(div, app2(s, x)), app2(s, y)) -> APP2(minus, x)
APP2(app2(div, app2(s, x)), app2(s, y)) -> APP2(app2(minus, x), y)
APP2(app2(div, app2(s, x)), app2(s, y)) -> APP2(s, app2(app2(div, app2(app2(minus, x), y)), app2(s, y)))
APP2(app2(map, f), app2(app2(cons, x), xs)) -> APP2(cons, app2(f, x))

The TRS R consists of the following rules:

app2(app2(map, f), nil) -> nil
app2(app2(map, f), app2(app2(cons, x), xs)) -> app2(app2(cons, app2(f, x)), app2(app2(map, f), xs))
app2(app2(minus, x), 0) -> x
app2(app2(minus, app2(s, x)), app2(s, y)) -> app2(app2(minus, x), y)
app2(app2(div, 0), app2(s, y)) -> 0
app2(app2(div, app2(s, x)), app2(s, y)) -> app2(s, app2(app2(div, app2(app2(minus, x), y)), app2(s, y)))

The set Q consists of the following terms:

app2(app2(map, x0), nil)
app2(app2(map, x0), app2(app2(cons, x1), x2))
app2(app2(minus, x0), 0)
app2(app2(minus, app2(s, x0)), app2(s, x1))
app2(app2(div, 0), app2(s, x0))
app2(app2(div, app2(s, x0)), app2(s, x1))

We have to consider all minimal (P,Q,R)-chains.

↳ QTRS
  ↳ Non-Overlap Check
    ↳ QTRS
      ↳ DependencyPairsProof
        ↳ QDP
          ↳ DependencyGraphProof

Q DP problem:
The TRS P consists of the following rules:

APP2(app2(minus, app2(s, x)), app2(s, y)) -> APP2(minus, x)
APP2(app2(map, f), app2(app2(cons, x), xs)) -> APP2(app2(cons, app2(f, x)), app2(app2(map, f), xs))
APP2(app2(map, f), app2(app2(cons, x), xs)) -> APP2(f, x)
APP2(app2(div, app2(s, x)), app2(s, y)) -> APP2(div, app2(app2(minus, x), y))
APP2(app2(minus, app2(s, x)), app2(s, y)) -> APP2(app2(minus, x), y)
APP2(app2(div, app2(s, x)), app2(s, y)) -> APP2(app2(div, app2(app2(minus, x), y)), app2(s, y))
APP2(app2(map, f), app2(app2(cons, x), xs)) -> APP2(app2(map, f), xs)
APP2(app2(div, app2(s, x)), app2(s, y)) -> APP2(minus, x)
APP2(app2(div, app2(s, x)), app2(s, y)) -> APP2(app2(minus, x), y)
APP2(app2(div, app2(s, x)), app2(s, y)) -> APP2(s, app2(app2(div, app2(app2(minus, x), y)), app2(s, y)))
APP2(app2(map, f), app2(app2(cons, x), xs)) -> APP2(cons, app2(f, x))

The TRS R consists of the following rules:

app2(app2(map, f), nil) -> nil
app2(app2(map, f), app2(app2(cons, x), xs)) -> app2(app2(cons, app2(f, x)), app2(app2(map, f), xs))
app2(app2(minus, x), 0) -> x
app2(app2(minus, app2(s, x)), app2(s, y)) -> app2(app2(minus, x), y)
app2(app2(div, 0), app2(s, y)) -> 0
app2(app2(div, app2(s, x)), app2(s, y)) -> app2(s, app2(app2(div, app2(app2(minus, x), y)), app2(s, y)))

The set Q consists of the following terms:

app2(app2(map, x0), nil)
app2(app2(map, x0), app2(app2(cons, x1), x2))
app2(app2(minus, x0), 0)
app2(app2(minus, app2(s, x0)), app2(s, x1))
app2(app2(div, 0), app2(s, x0))
app2(app2(div, app2(s, x0)), app2(s, x1))

We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [13,14,18] contains 3 SCCs with 7 less nodes.

↳ QTRS
  ↳ Non-Overlap Check
    ↳ QTRS
      ↳ DependencyPairsProof
        ↳ QDP
          ↳ DependencyGraphProof
            ↳ AND
              ↳ QDP
                ↳ QDPOrderProof
              ↳ QDP
              ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

APP2(app2(minus, app2(s, x)), app2(s, y)) -> APP2(app2(minus, x), y)

The TRS R consists of the following rules:

app2(app2(map, f), nil) -> nil
app2(app2(map, f), app2(app2(cons, x), xs)) -> app2(app2(cons, app2(f, x)), app2(app2(map, f), xs))
app2(app2(minus, x), 0) -> x
app2(app2(minus, app2(s, x)), app2(s, y)) -> app2(app2(minus, x), y)
app2(app2(div, 0), app2(s, y)) -> 0
app2(app2(div, app2(s, x)), app2(s, y)) -> app2(s, app2(app2(div, app2(app2(minus, x), y)), app2(s, y)))

The set Q consists of the following terms:

app2(app2(map, x0), nil)
app2(app2(map, x0), app2(app2(cons, x1), x2))
app2(app2(minus, x0), 0)
app2(app2(minus, app2(s, x0)), app2(s, x1))
app2(app2(div, 0), app2(s, x0))
app2(app2(div, app2(s, x0)), app2(s, x1))

We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].


The following pairs can be strictly oriented and are deleted.


APP2(app2(minus, app2(s, x)), app2(s, y)) -> APP2(app2(minus, x), y)
The remaining pairs can at least by weakly be oriented.
none
Used ordering: Combined order from the following AFS and order.
APP2(x1, x2)  =  x1
app2(x1, x2)  =  app2(x1, x2)
minus  =  minus
s  =  s

Lexicographic Path Order [19].
Precedence:
trivial


The following usable rules [14] were oriented: none



↳ QTRS
  ↳ Non-Overlap Check
    ↳ QTRS
      ↳ DependencyPairsProof
        ↳ QDP
          ↳ DependencyGraphProof
            ↳ AND
              ↳ QDP
                ↳ QDPOrderProof
                  ↳ QDP
                    ↳ PisEmptyProof
              ↳ QDP
              ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

app2(app2(map, f), nil) -> nil
app2(app2(map, f), app2(app2(cons, x), xs)) -> app2(app2(cons, app2(f, x)), app2(app2(map, f), xs))
app2(app2(minus, x), 0) -> x
app2(app2(minus, app2(s, x)), app2(s, y)) -> app2(app2(minus, x), y)
app2(app2(div, 0), app2(s, y)) -> 0
app2(app2(div, app2(s, x)), app2(s, y)) -> app2(s, app2(app2(div, app2(app2(minus, x), y)), app2(s, y)))

The set Q consists of the following terms:

app2(app2(map, x0), nil)
app2(app2(map, x0), app2(app2(cons, x1), x2))
app2(app2(minus, x0), 0)
app2(app2(minus, app2(s, x0)), app2(s, x1))
app2(app2(div, 0), app2(s, x0))
app2(app2(div, app2(s, x0)), app2(s, x1))

We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS
  ↳ Non-Overlap Check
    ↳ QTRS
      ↳ DependencyPairsProof
        ↳ QDP
          ↳ DependencyGraphProof
            ↳ AND
              ↳ QDP
              ↳ QDP
              ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

APP2(app2(div, app2(s, x)), app2(s, y)) -> APP2(app2(div, app2(app2(minus, x), y)), app2(s, y))

The TRS R consists of the following rules:

app2(app2(map, f), nil) -> nil
app2(app2(map, f), app2(app2(cons, x), xs)) -> app2(app2(cons, app2(f, x)), app2(app2(map, f), xs))
app2(app2(minus, x), 0) -> x
app2(app2(minus, app2(s, x)), app2(s, y)) -> app2(app2(minus, x), y)
app2(app2(div, 0), app2(s, y)) -> 0
app2(app2(div, app2(s, x)), app2(s, y)) -> app2(s, app2(app2(div, app2(app2(minus, x), y)), app2(s, y)))

The set Q consists of the following terms:

app2(app2(map, x0), nil)
app2(app2(map, x0), app2(app2(cons, x1), x2))
app2(app2(minus, x0), 0)
app2(app2(minus, app2(s, x0)), app2(s, x1))
app2(app2(div, 0), app2(s, x0))
app2(app2(div, app2(s, x0)), app2(s, x1))

We have to consider all minimal (P,Q,R)-chains.

↳ QTRS
  ↳ Non-Overlap Check
    ↳ QTRS
      ↳ DependencyPairsProof
        ↳ QDP
          ↳ DependencyGraphProof
            ↳ AND
              ↳ QDP
              ↳ QDP
              ↳ QDP
                ↳ QDPOrderProof

Q DP problem:
The TRS P consists of the following rules:

APP2(app2(map, f), app2(app2(cons, x), xs)) -> APP2(f, x)
APP2(app2(map, f), app2(app2(cons, x), xs)) -> APP2(app2(map, f), xs)

The TRS R consists of the following rules:

app2(app2(map, f), nil) -> nil
app2(app2(map, f), app2(app2(cons, x), xs)) -> app2(app2(cons, app2(f, x)), app2(app2(map, f), xs))
app2(app2(minus, x), 0) -> x
app2(app2(minus, app2(s, x)), app2(s, y)) -> app2(app2(minus, x), y)
app2(app2(div, 0), app2(s, y)) -> 0
app2(app2(div, app2(s, x)), app2(s, y)) -> app2(s, app2(app2(div, app2(app2(minus, x), y)), app2(s, y)))

The set Q consists of the following terms:

app2(app2(map, x0), nil)
app2(app2(map, x0), app2(app2(cons, x1), x2))
app2(app2(minus, x0), 0)
app2(app2(minus, app2(s, x0)), app2(s, x1))
app2(app2(div, 0), app2(s, x0))
app2(app2(div, app2(s, x0)), app2(s, x1))

We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].


The following pairs can be strictly oriented and are deleted.


APP2(app2(map, f), app2(app2(cons, x), xs)) -> APP2(f, x)
The remaining pairs can at least by weakly be oriented.

APP2(app2(map, f), app2(app2(cons, x), xs)) -> APP2(app2(map, f), xs)
Used ordering: Combined order from the following AFS and order.
APP2(x1, x2)  =  APP1(x1)
app2(x1, x2)  =  app1(x2)
map  =  map
cons  =  cons

Lexicographic Path Order [19].
Precedence:
APP1 > map
app1 > map
cons > map


The following usable rules [14] were oriented: none



↳ QTRS
  ↳ Non-Overlap Check
    ↳ QTRS
      ↳ DependencyPairsProof
        ↳ QDP
          ↳ DependencyGraphProof
            ↳ AND
              ↳ QDP
              ↳ QDP
              ↳ QDP
                ↳ QDPOrderProof
                  ↳ QDP
                    ↳ QDPOrderProof

Q DP problem:
The TRS P consists of the following rules:

APP2(app2(map, f), app2(app2(cons, x), xs)) -> APP2(app2(map, f), xs)

The TRS R consists of the following rules:

app2(app2(map, f), nil) -> nil
app2(app2(map, f), app2(app2(cons, x), xs)) -> app2(app2(cons, app2(f, x)), app2(app2(map, f), xs))
app2(app2(minus, x), 0) -> x
app2(app2(minus, app2(s, x)), app2(s, y)) -> app2(app2(minus, x), y)
app2(app2(div, 0), app2(s, y)) -> 0
app2(app2(div, app2(s, x)), app2(s, y)) -> app2(s, app2(app2(div, app2(app2(minus, x), y)), app2(s, y)))

The set Q consists of the following terms:

app2(app2(map, x0), nil)
app2(app2(map, x0), app2(app2(cons, x1), x2))
app2(app2(minus, x0), 0)
app2(app2(minus, app2(s, x0)), app2(s, x1))
app2(app2(div, 0), app2(s, x0))
app2(app2(div, app2(s, x0)), app2(s, x1))

We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].


The following pairs can be strictly oriented and are deleted.


APP2(app2(map, f), app2(app2(cons, x), xs)) -> APP2(app2(map, f), xs)
The remaining pairs can at least by weakly be oriented.
none
Used ordering: Combined order from the following AFS and order.
APP2(x1, x2)  =  APP1(x2)
app2(x1, x2)  =  app1(x2)
map  =  map
cons  =  cons

Lexicographic Path Order [19].
Precedence:
[APP1, app1] > [map, cons]


The following usable rules [14] were oriented: none



↳ QTRS
  ↳ Non-Overlap Check
    ↳ QTRS
      ↳ DependencyPairsProof
        ↳ QDP
          ↳ DependencyGraphProof
            ↳ AND
              ↳ QDP
              ↳ QDP
              ↳ QDP
                ↳ QDPOrderProof
                  ↳ QDP
                    ↳ QDPOrderProof
                      ↳ QDP
                        ↳ PisEmptyProof

Q DP problem:
P is empty.
The TRS R consists of the following rules:

app2(app2(map, f), nil) -> nil
app2(app2(map, f), app2(app2(cons, x), xs)) -> app2(app2(cons, app2(f, x)), app2(app2(map, f), xs))
app2(app2(minus, x), 0) -> x
app2(app2(minus, app2(s, x)), app2(s, y)) -> app2(app2(minus, x), y)
app2(app2(div, 0), app2(s, y)) -> 0
app2(app2(div, app2(s, x)), app2(s, y)) -> app2(s, app2(app2(div, app2(app2(minus, x), y)), app2(s, y)))

The set Q consists of the following terms:

app2(app2(map, x0), nil)
app2(app2(map, x0), app2(app2(cons, x1), x2))
app2(app2(minus, x0), 0)
app2(app2(minus, app2(s, x0)), app2(s, x1))
app2(app2(div, 0), app2(s, x0))
app2(app2(div, app2(s, x0)), app2(s, x1))

We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.